Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
21	Structural approximation Boris Zilber University of Oxford March 5, Add to Reading List Source URL: people.maths.ox.ac.uk Language: English - Date: 2010-03-05 10:02:06 Mathematics Model theory Abstraction Structure General topology Type Topological space Constructible universe Filter Ring Ultraproduct Metric space
22	Introduction to Numerical Analysis Spring 2016 Problem Set 9 Solutions Problem 1. Consider the integral Z Add to Reading List Source URL: homerreid.dyndns.org Language: English - Date: 2016-04-27 10:48:23 Mathematical analysis Mathematics Numerical integration Orthogonal polynomials ClenshawCurtis quadrature Approximation theory Fourier analysis Exponentiation Chebyshev polynomials Bessel function
23	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
24	Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung Band 2, 1997 A. Bottcher On the Approximation Numbers of Large Toeplitz Matrices Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2014-07-15 07:16:38 Mathematics Abstract algebra Mathematical analysis Modular forms Operator theory Joachim Cuntz Hertrich Cyclic homology Modular curve Crossed product
25	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-03-13 08:17:47 Computational complexity theory Mathematics NP-complete problems Theory of computation Set cover problem Approximation algorithm Algorithm Analysis of algorithms Bin packing problem Vertex cover
26	Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 skipped Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-04 12:26:59 Mathematics Mathematical analysis Mathematical induction Integer sequences Approximation theory Mathematical series Binomial coefficient Aurifeuillean factorization
27	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity
28	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
29	LOCAL-GLOBAL PRINCIPLE FOR RATIONAL POINTS AND ZERO-CYCLES ARIZONA WINTER SCHOOL 2015 ´ ENE ` JEAN-LOUIS COLLIOT-THEL Add to Reading List Source URL: www.math.u-psud.fr Language: English - Date: 2015-05-30 03:42:10 Algebra Abstract algebra Mathematics Field theory Algebraic number theory Diophantine geometry Algebraic varieties Brauer group Ring theory Approximation in algebraic groups Hasse principle Rational variety
30	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding

UPDATE